منابع مشابه
Continuous Set Packing and Near-Boolean Functions
Given a family of feasible subsets of a ground set, the packing problem is to find a largest subfamily of pairwise disjoint family members. Non-approximability renders heuristics attractive viable options, while efficient methods with worst-case guarantee are a key concern in computational complexity. This work proposes a novel near-Boolean optimization method relying on a polynomial multilinea...
متن کاملLower Bounds on Representing Boolean Functions as Polynomials in Zm
Deene the MOD m-degree of a boolean function F to be the smallest degree of any polynomial P, over the ring of integers modulo m, such that for all 0-1 assignments ~ x, F(~ x) = 0 ii P(~ x) = 0. By exploring the periodic property of the binomial coeecients modulo m, two new lower bounds on the MOD m-degree of the MOD l and :MOD m functions are proved, where m is any composite integer and l has ...
متن کاملRepresenting Boolean Functions Using Polynomials: More Can Offer Less
Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In practical applications, it is desirable to find a polynomial representation with the smallest number of terms possible, in order to use the least possible number ...
متن کاملBoolean Functions with Ordered Domains in Answer Set Programming
Boolean functions in Answer Set Programming have proven a useful modelling tool. They are usually specified by means of aggregates or external atoms. A crucial step in computing answer sets for logic programs containing Boolean functions is verifying whether partial interpretations satisfy a Boolean function for all possible values of its undefined atoms. In this paper, we develop a new methodo...
متن کاملBernstein's polynomials for convex functions and related results
In this paper we establish several polynomials similar to Bernstein's polynomials and several refinements of Hermite-Hadamard inequality for convex functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1993
ISSN: 0895-7177
DOI: 10.1016/0895-7177(93)90012-n